1 A ug 2 01 7 Some new sufficient conditions for 2 p - Hamilton - biconnectedness of graphs ∗
نویسندگان
چکیده
A balanced bipartite graph G is said to be 2p-Hamilton-biconnected if for any balanced subset W of size 2p of V (G), the subgraph induced by V (G)\W is Hamilton-biconnected. In this paper, we prove that “ Let p ≥ 0 and G be a balanced bipartite graph of order 2n with minimum degree δ(G) ≥ k, where n ≥ 2k − p + 2 and k ≥ p. If the number of edges e(G) > n(n − k + p− 1) + (k+2)(k−p+1), then G is 2p-Hamilton-biconnected except some exceptions.” Furthermore, this result is used to present two new spectral conditions for a graph to 2p-Hamilton-biconnected. Moreover, the similar results are also presented for nearly balanced bipartite graphs. AMS Classification: 05C38, 05C50.
منابع مشابه
Metric Embedding via Shortest Path Decompositions
We study the problem of embedding weighted graphs of pathwidth k into `p spaces. Our main result is an O(kmin{/p,/2})-distortion embedding. For p = 1, this is a super-exponential improvement over the best previous bound of Lee and Sidiropoulos. Our distortion bound is asymptotically tight for any fixed p > 1. Our result is obtained via a novel embedding technique that is based on low depth deco...
متن کاملHamilton Cycle Rich 2-factorizations of Complete Multipartite Graphs
For any two 2-regular spanning subgraphs G and H of the complete multipartite graph K, necessary and sufficient conditions are found for the existence of a 2-factorization of K in which (1) the first and second 2-factors are isomorphic to G and H respectively, and (2) each other 2-factor is a hamilton cycle, in the case where K has an odd number of vertices.
متن کاملSufficient Conditions for a New Class of Polynomial Analytic Functions of Reciprocal Order alpha
In this paper, we consider a new class of analytic functions in the unit disk using polynomials of order alpha. We give some sufficient conditions for functions belonging to this class.
متن کاملVertex-Oriented Hamilton Cycles in Directed Graphs
Let D be a directed graph of order n. An anti-directed Hamilton cycle H in D is a Hamilton cycle in the graph underlying D such that no pair of consecutive arcs in H form a directed path in D. We prove that if D is a directed graph with even order n and if the indegree and the outdegree of each vertex of D is at least 23n then D contains an anti-directed Hamilton cycle. This improves a bound of...
متن کاملOn zero-divisor graphs of quotient rings and complemented zero-divisor graphs
For an arbitrary ring $R$, the zero-divisor graph of $R$, denoted by $Gamma (R)$, is an undirected simple graph that its vertices are all nonzero zero-divisors of $R$ in which any two vertices $x$ and $y$ are adjacent if and only if either $xy=0$ or $yx=0$. It is well-known that for any commutative ring $R$, $Gamma (R) cong Gamma (T(R))$ where $T(R)$ is the (total) quotient ring of $R$. In this...
متن کامل